Systematic Literature Review Robust Graph Coloring on Electric Circuit Problems

نویسندگان

چکیده

Graph Coloring Problem (GCP) is the assignment of colors to certain elements in a graph based on constraints. GCP used by assigning color label each node with neighboring nodes assigned different and minimum number used. Based this, can be drawn into an optimization problem that minimize Optimization problems coloring occur due uncertainty use used, so it assumed there colored vertices. One mathematical methods presence Robust (RO). RO modeling methodology combined computational tools process uncertain data only some for which certainty known. This paper will review research model validation applied electrical circuit using systematic literature. A literature was carried out Preferred Reporting Items Systematic reviews Meta Analysis (PRISMA) method. The keywords this study were search articles related database. results obtained from PRISMA Bibliometric R Software, found relationship between Coloring, means at least one researcher who has studied problem. However, Electricity keyword no relation other two keywords, gap possible if not been discussed researchers. study, hoped as consideration better solution solve problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automatic Service Composition Based on Graph Coloring

Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...

متن کامل

dynamic coloring of graph

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

15 صفحه اول

Automatic Service Composition Based on Graph Coloring

Web services as independent software components are published on the Internet by service providers and services are then called by users’ request. However, in many cases, no service alone can be found in the service repository that could satisfy the applicant satisfaction. Service composition provides new components by using an interactive model to accelerate the programs. Prior to service comp...

متن کامل

Parallel Metaheuristics for Robust Graph Coloring Problem

In this chapter a new formulation of the robust graph coloring problem (RGCP) is proposed. In opposition to classical GCP defined for the given graph G(V,E) not only elements of E but also Ē can be subject of color conflicts in edge vertices. Conflicts in Ē are assigned penalties 0<P(e)<1. In addition to satisfying constraints related to the number of colors and/or a threshold of the acceptable...

متن کامل

Graph Coloring: History, results and open problems

Coloring theory started with the problem of coloring the countries of a map in such a way that no two countries that have a common border receive the same color. If we denote the countries by points in the plane and connect each pair of points that correspond to countries with a common border by a curve, we obtain a planar graph. The celebrated Four Color Problem asks if every planar graph can ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: JTAM (Jurnal Teori dan Aplikasi Matematika)

سال: 2022

ISSN: ['2597-7512', '2614-1175']

DOI: https://doi.org/10.31764/jtam.v6i4.9446